Bi-objective Recoverable Berth Allocation and Quay Crane Assignment Planning under Environmental Uncertainty
نویسندگان
چکیده
This study discusses the development of tactical-level integrated planning at seaport container terminals in an uncertain environment.
منابع مشابه
Robust Scheduling for Berth Allocation and Quay Crane Assignment Problem
Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...
متن کاملSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملA Genetic Algorithm for Berth Allocation and Quay Crane Assignment
Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...
متن کاملAn Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment
In this paper we study the simultaneous optimization of berth allocation and quay crane assignment in seaport container terminals. We propose a model based on an exponential number of variables that is solved via column generation. An exact branch-and-price algorithm is implemented to produce optimal integer solutions to the problem. In particular, we present several accelerating techniques for...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Technology: IJ Tech
سال: 2022
ISSN: ['2087-2100']
DOI: https://doi.org/10.14716/ijtech.v13i3.5269